Jijun Zhao, Ferenc Szidarovszky and Miklos N. Szilagyi: Finite Neighborhood Binary Games
نویسندگان
چکیده
The purpose of this study is to present a systematic analysis of the long-term behavior of the agents of an artificial society under varying payoff functions in finite neighborhood binary games. By assuming the linearity of the payoffs of both cooperating and defecting agents, the type of the game is determined by four fundamental parameters. By fixing the values of three of them and systematically varying the fourth one we can observe a transition from Prisoner's Dilemma to Leader Game through Chicken and Benevolent Chicken Games. By using agent-based simulation we are able to observe the long-term behavior of the artificial society with different and gradually changing payoff structure. The difference between different games is explored and the effect of the transition from one game to the other on the society is investigated. The results depend on the personality types of the agents. In this study greedy and Pavlovian agents are considered. In the first case, we observe the most significant change in trajectory structure between Prisoner's Dilemma and Chicken Games showing significant difference in the behavioral patterns of the agents. Almost no changes can be observed between Benevolent Chicken and Leader Games, and only small change between Chicken and Benevolent Chicken. The trajectories change from always converging to regularly oscillating patterns with systematically altering amplitude and central values. The results are very similar whether the agents consider themselves as members of their neighborhoods or not. With Pavlovian agents no significant difference can be observed between the four games, the trajectories always converge and the limits smoothly and monotonically depend on the value of the varying parameter.
منابع مشابه
An Investigation of N-person Prisoners' Dilemmas
This paper is an attempt to systematically present the problem of various N-person Prisoners’ Dilemma games and some of their possible solutions. 13 characteristics of the game are discussed. The role of payoff curves, personalities, and neighborhood is investigated. Experiments are performed with a new simulation tool for multi-agent Prisoners’ Dilemma games. Investigations of realistic situat...
متن کاملInvestigation of N-Person Games by Agent-Based Modeling
The recent developments in agent-based modeling of several N-person games are reviewed and some features of the author’s software tools as well as some applications are described. After explaining the transition from two-person to N-person games, the classification and properties of N-person games, our software tools, and agent personalities, the following N-person games are considered: prisone...
متن کاملInvasive Species Control Optimization as a Dynamic Spatial Process: An Application to Buffelgrass (Pennisetum ciliare) in Arizona
libraries, and research funders in the common goal of maximizing access to critical research. Invasive Species Control Optimization as a Dynamic Spatial Process: An Application to Buffelgrass (Pennisetum ciliare) in Arizona Author(s): İ. Esra Büyüktahtakin , Zhuo Feng , Aaryn D. Olsson , George Frisvold and Ferenc Szidarovszky Source: Invasive Plant Science and Management, 7(1):132-146. 2014. P...
متن کاملAgent-Based Simulation of N-Person Games with Crossing Payoff Functions
We report on computer simulation experiments using our agent-based simulation tool to model uniform N-person games with crossing payoff functions. We study the case when agents are greedy simpletons who imitate the action of their neighbor that received the highest payoff for its previous action. The individual agents may cooperate with each other for the collective interest or may defect, that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007